package cuiyt.datastructure.queue.criclequeue.decirclequeue;
/**
 * @author cyt
 * @create 2020-12-05 21:03
 */
public class DeCriCleQueueTest {

    public static void main(String[] args) {
         DeCriCleQueue<Integer> queue = new DeCriCleQueue<>();

        for (int i = 0; i < 10; i++) {
            queue.enDeQueueFront(i + 1);
            queue.enDeQueueRear(i + 100);
        }
        System.out.println(queue);

        for (int i = 0; i < 3; i++) {
            queue.deDeQueueFront();
            queue.deDeQueueRear();
        }

        queue.enDeQueueFront(11);
        queue.enDeQueueFront(12);
        System.out.println(queue);
        while (!queue.isEmpty()) {
            System.out.println(queue.deDeQueueFront());
        }
    }

}
